Synthesizing an Automata-based Representation of BPMN2 Choreography Diagrams
نویسندگان
چکیده
Choreographies are an emergent Service Engineering approach to compose together and coordinate distributed services. They represent a global specification of the interactions between the participant services. BPMN2 provides a dedicated notation, called Choreography Diagrams, to define choreographies. This paper presents a model transformation to automatically transform a BPMN2 choreography specification into an automata-based representation called Choreography LTS (CLTS). The latter is a LTS suitably extended to, on one side model the complex interactions that can be specified by choreography diagrams, on the other provide modelers with a means to precisely extract the not-easy-to-grasp coordination logic “hidden” into BPMN2 Choreography Diagrams. Dedicated Eclipse plugins, within the CHOReOSynt tool, have been developed to support the presented transformation.
منابع مشابه
MDA applied: From Sequence Diagrams to Web Service Choreography
Web Services and Web Service composition languages for Web Service choreography are becoming more and more important in the area for inter-enterprise application and process integration. A huge amount of work has been done in the area of business process while web service composition languages have been the subject of intense research efforts recently. However the aspects of modeling these soft...
متن کاملFrom Orchestration to Choreography through Contract Automata
We study the relations between a contract automata and an interaction model. In the former model, distributed services are abstracted away as automata oblivious of their partners that coordinate with each other through an orchestrator. The interaction model relies on channel-based asynchronous communication and choreography to coordinate distributed services. We define a notion of strong agreem...
متن کاملRelating two automata-based models of orchestration and choreography
We investigate the relations between two automata-based models for describing and studying distributed services, called contract automata and communicating machines. In the first model, distributed services are abstracted away as automata oblivious of their partners that coordinate with each other through an orchestrator. The second one is concerned with the interactions occurring between distr...
متن کاملTimed Automata Semantics for Visual e-Contracts
C-O Diagrams have been introduced as a means to have a more visual representation of electronic contracts, where it is possible to represent the obligations, permissions and prohibitions of the different signatories, as well as what are the penalties in case of not fulfillment of their obligations and prohibitions. In such diagrams we are also able to represent absolute and relative timing cons...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014